Search results for "Weapon target assignment problem"

showing 2 items of 2 documents

The minimal cost maximum matching of a graph (supplementary remarks)

1971

In addition to the preceding paper, it will be shown that (1) the matching problem is closely related to the linear assignment problem and how (2) this property can be taken advantage of for solving the matching problem.

Linear bottleneck assignment problemMathematical optimizationProperty (philosophy)Matching (graph theory)General Mathematics3-dimensional matchingGraph (abstract data type)Management Science and Operations ResearchAssignment problemSoftwareGeneralized assignment problemWeapon target assignment problemMathematicsUnternehmensforschung Operations Research - Recherche Opérationnelle
researchProduct

A graph colouring model for assigning a heterogeneous workforce to a given schedule

1996

Abstract We analyze a heterogeneous workforce assignment problem in which the minimum number of workers required to carry out a machine load plan is calculated. The problem is formulated as a restricted vertex colouring problem and a branch and bound algorithm is presented. The special characteristics of the graph to be coloured allow an efficient implementation of the branch and bound. Computational results show that the algorithm can solve problems of 50 activities, 5, 10 and 15 machines and between 2 to 15 different types of workers in just a few seconds.

Vertex (graph theory)Mathematical optimizationScheduleInformation Systems and ManagementGeneral Computer ScienceBranch and boundManagement Science and Operations ResearchIndustrial and Manufacturing EngineeringModeling and SimulationGraph (abstract data type)Resource allocationBranch and cutAssignment problemWeapon target assignment problemMathematicsEuropean Journal of Operational Research
researchProduct